Author : V.Geetha 1
Date of Publication :10th January 2018
Abstract: Data sharing scheme by using attribute-based to reduce the key escrow issue but also develops the expressiveness of attribute, because of that the resulting scheme is more user-friendly to cloud computing. In this proposed work we are introducing an improved two-party key issuing protocol that can guarantee that neither key authority nor cloud service operator can compromise the whole secret key of a user individually. We introduce the concept of the attribute with weight, being provided to enhance the expression of the attribute, which can not only extend the expression from binary to the arbitrary state but also lighten the complexity of access policy. So that, both storage cost and encryption complexities for a ciphertext are relieved. In our proposed work the modification process is after the data owner sends the secret key to the user, the particular cloud user can view the data which is stored on the cloud server. Once the user used that secret key means the key will be automatically changed for that shared data, this dynamic key will be sent to the data owner also.
Reference :
-
- J. Baek, Q. H. Vu, J. K. Liu, X. Huang, and Y. Xiang, “A secure cloud computing based framework for big data information management of smart grid,” IEEE Trans. Cloud Comput., vol. 3, no. 2, pp. 233–244, Apr./Jun. 2015.
- A. Balu and K. Kuppusamy, “An expressive and provably secure ciphertext-policy attribute-based encryption,” Inf. Sci., vol. 276, no. 4, pp. 354–362, Aug. 2014.
- M. Belenkiy, J. Camenisch, M. Chase, M. Kohlweiss, A. Lysyanskaya, and H. Shacham, “Randomizable proofs and delegatable anonymous credentials,” in Proc. 29th Annu. Int. Cryptol. Conf., 2009, pp. 108–125.
- J. Bethencourt, A. Sahai, and B. Waters, “Ciphertextpolicy attributebased encryption,” in Proc. IEEE Symp. Secur. Privacy, May 2007, pp. 321–334.
- D. Boneh, B. Lynn, and H. Shacham, “Short signatures from the Weil pairing,” J. Cryptol., vol. 17, no. 4, pp. 297–319, 2004.
- M. Chase, “Multi-authority attribute based encryption,” in Proc. 4th Conf. Theory Cryptogr., 2007, pp. 515–534.
- M. Chase and S. S. M. Chow, “Improving privacy and security in multiauthority attribute-based encryption,” in Proc. 16th ACM Conf. Comput. Commun. Secur., 2009, pp. 121–130.
- L. Cheung and C. Newport, “Provably secure ciphertext policy ABE,” in Proc. 14th ACM Conf. Comput. Commun. Secur., 2007, pp. 456–465.
- S. S. M. Chow, “Removing escrow from identitybased encryption,” in Proc. 12th Int. Conf. Pract. Theory Public Key Cryptogr., 2009, pp. 256–276.
- C.-K. Chu, W.-T. Zhu, J. Han, J.-K. Liu, J. Xu, and J. Zhou, “Security concerns in popular cloud storage services,” IEEE Pervasive Comput., vol. 12, no. 4, pp. 50–57, Oct./Dec. 2013.
- A. De Caro and V. Iovino, “JPBC: Java pairing based cryptography,” in Proc. 16th IEEE Symp. Comput. Commun., Jun./Jul. 2011, pp. 850–855.
- H. Deng et al., “Ciphertext-policy hierarchical attribute-based encryption with short ciphertexts,” Inf. Sci., vol. 275, no. 11, pp. 370–384, Aug. 2014.
- C.-I. Fan, V. S.-M. Huang, and H.-M. Ruan, “Arbitrary-state attributebased encryption with dynamic membership,” IEEE Trans. Comput., vol. 63, no. 8, pp. 1951–1961, Aug. 2014.
- V. Goyal, O. Pandey, A. Sahai, and B. Waters, “Attribute-based encryption for fine-grained access control of encrypted data,” in Proc. 13th ACM Conf. Comput. Commun. Secur., 2006, pp. 89–98.
- J. Hur, “Improving security and efficiency in attribute-based data sharing,” IEEE Trans. Knowl. Data Eng., vol. 25, no. 10, pp. 2271–2282, Oct. 2013.